Temporal correlation coefficient for directed networks

نویسندگان

  • Kathrin Büttner
  • Jennifer Salau
  • Joachim Krieter
چکیده

Previous studies dealing with network theory focused mainly on the static aggregation of edges over specific time window lengths. Thus, most of the dynamic information gets lost. To assess the quality of such a static aggregation the temporal correlation coefficient can be calculated. It measures the overall possibility for an edge to persist between two consecutive snapshots. Up to now, this measure is only defined for undirected networks. Therefore, we introduce the adaption of the temporal correlation coefficient to directed networks. This new methodology enables the distinction between ingoing and outgoing edges. Besides a small example network presenting the single calculation steps, we also calculated the proposed measurements for a real pig trade network to emphasize the importance of considering the edge direction. The farm types at the beginning of the pork supply chain showed clearly higher values for the outgoing temporal correlation coefficient compared to the farm types at the end of the pork supply chain. These farm types showed higher values for the ingoing temporal correlation coefficient. The temporal correlation coefficient is a valuable tool to understand the structural dynamics of these systems, as it assesses the consistency of the edge configuration. The adaption of this measure for directed networks may help to preserve meaningful additional information about the investigated network that might get lost if the edge directions are ignored.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A method for analyzing the problem of determining the maximum common fragments of temporal directed tree, that do not change with time

In this study two actual types of problems are considered and solved: 1) determining the maximum common connected fragment of the T-tree (T-directed tree) which does not change with time; 2) determining all maximum common connected fragments of the T-tree (T-directed tree) which do not change with time. The choice of the primary study of temporal directed trees and trees is justified by the wid...

متن کامل

Which is effective: self-directed learning or tutor-directed learning on the level of nursing skills

Introduction. This is quasi experimental research in order to determine and compare the learning level of nursing skills ( in B.A students) with self-directed learning and tutor-directed learning pattern in Shaheed Beheshti Univeristy of Medical Sciences and Health Services, Nursing and Midwifery faculty, 1998-1999. Methods. First of all, a questionnaire composed of some demographic data such ...

متن کامل

Analysis of temporal and spatial correlation between precipitable water vapor retrievals from AIRS satellite sensor and 29 synoptic station measurements in Iran

Precipitable Water Vapor (PWV) is one of the most important quantities in meteorology and climate studies. PWV in Earth's atmosphere can be measured by Sun-photometer, the Atmospheric Infrared Sounder (AIRS), and radiosonde from surface, atmosphere and space-based systems, respectively. In this paper, we use PWV measured by Sun-photometer located in Institute for Advanced Studies in Basic Scien...

متن کامل

Non-consensus opinion model on directed networks

Dynamic social opinion models have been widely studied on undirected networks, and most of them are based on spin interaction models that produce a consensus. In reality, however, many networks such as Twitter and the World Wide Web are directed and are composed of both unidirectional and bidirectional links. Moreover, from choosing a coffee brand to deciding who to vote for in an election, two...

متن کامل

Degree-degree correlations in directed networks with heavy-tailed degrees

In network theory, Pearson’s correlation coefficients are most commonly used to measure the degree assortativity of a network. We investigate the behavior of these coefficients in the setting of directed networks with heavy-tailed degree sequences. We prove that for graphs where the inand out-degree sequences satisfy a power law, Pearson’s correlation coefficients converge to a non-negative num...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره 5  شماره 

صفحات  -

تاریخ انتشار 2016